2 9 D ec 2 00 8 On potentially K 6 − C 5 graphic sequences ∗
نویسندگان
چکیده
For given a graph H , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. In this paper, we characterize the potentially K6 − C5 -graphic sequences .
منابع مشابه
ar X iv : 0 81 2 . 48 61 v 2 [ m at h . C O ] 8 J ul 2 00 9 On Potentially K 6 − C 5 graphic Sequences ∗
For given a graph H , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. In this paper, we characterize the potentially K6 − C5 -graphic sequences .
متن کاملar X iv : m at h / 07 02 24 5 v 1 [ m at h . C O ] 9 F eb 2 00 7 On Potentially K 5 − E 3 - graphic Sequences ∗
Let Km −H be the graph obtained from Km by removing the edges set E(H) of H where H is a subgraph of Km. We use the symbol A3 to denote P2 ∪K2. In this paper, we characterize the potentially K5 − P3, K5 −A3, K5 −K3 and K5 −K1,3-graphic sequences. Two characterizations of these imply two theorems due to Lai [11-12].
متن کاملar X iv : 0 90 1 . 13 57 v 2 [ m at h . C O ] 1 0 Ju l 2 00 9 A Characterization On Potentially K 2 , 5 - graphic Sequences ∗
For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. Let Km − H be the graph obtained from Km by removing the edges set E(H) where H is a subgraph of Km. In this paper, we characterize potentially K2,5-graphic sequences. This characterization implies a special case of a theorem due to ...
متن کاملar X iv : 0 80 1 . 06 58 v 1 [ m at h . C O ] 4 J an 2 00 8 On Potentially 3 - regular graph graphic Sequences ∗
For given a graphH , a graphic sequence π = (d1, d2, · · · , dn) is said to be potentially H-graphic if there exists a realization of π containing H as a subgraph. In this paper, we characterize the potentially Hgraphic sequences where H denotes 3-regular graph with 6 vertices. In other words, we characterize the potentially K3,3 and K6 − C6graphic sequences where Kr,r is an r × r complete bipa...
متن کاملul 2 00 6 An extremal problem on potentially K m − P k - graphic sequences ∗
A sequence S is potentially Km−Pk graphical if it has a realization containing a Km −Pk as a subgraph. Let σ(Km −Pk, n) denote the smallest degree sum such that every n-term graphical sequence S with σ(S) ≥ σ(Km−Pk, n) is potentially Km−Pk graphical. In this paper, we prove that σ(Km−Pk, n) ≥ (2m−6)n−(m−3)(m−2)+2, for n ≥ m ≥ k + 1 ≥ 4. We conjecture that equality holds for n ≥ m ≥ k + 1 ≥ 4. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009